A multicriteria linear programming problem with integer variables and parameterized optimality principle "from lexicographic to Slater" is considered. A situation in which initial coefficients of penalty cost functions are not fixed but may be potentially a subject to variations is studied. For any efficient solution, appropriate measures of the quality are introduced which incorporate information about variations of penalty cost function coefficients. These measures correspond to the so-called stability and accuracy functions defined earlier for efficient solutions of a generic multicriteria combinatorial optimization problem with Pareto and lexicographic optimality principles. Various properties of such functions are studied and maximum n...
AbstractWe consider multiple objective 0–1 programming problems in the situation where parameters of...
The paper concerns multiobjective linear optimization problems in Rn that are parameterized with res...
International audienceThis work proposes an upper bound on the maximal number of non-dominated point...
A multicriteria Boolean programming problem with linear cost functions in which initial coefficients...
We consider a vector generic combinatorial optimization problem in which initial coefficients of obj...
A multicriteria combinatorial problem with minimin partial criteria is considered. Necessary and suf...
We consider the multicriteria problem of combinatorial optimization with partial criteria of the kin...
International audienceCombinatorial optimization problems serve as models for a great number of real...
A multiobjective problem of integer linear programming with parametric optimality is addressed. The ...
In this paper, a lexicographic multicriteria optimization problem with interval coefficients is cons...
We consider a multiple objective combinatorial optimization problem with an arbitrary vector-criteri...
We consider a multicriteria lexicographic Boolean problem of minimizing absolute deviations of linea...
Multi-criteria optimization problems naturally arise in practice when there is no single criterion f...
In the paper we investigate the possibility of finding the Pareto set in combinatorial multicriteria...
multicriteria linear combinatorial problem is considered, principle of optimality of which is defi...
AbstractWe consider multiple objective 0–1 programming problems in the situation where parameters of...
The paper concerns multiobjective linear optimization problems in Rn that are parameterized with res...
International audienceThis work proposes an upper bound on the maximal number of non-dominated point...
A multicriteria Boolean programming problem with linear cost functions in which initial coefficients...
We consider a vector generic combinatorial optimization problem in which initial coefficients of obj...
A multicriteria combinatorial problem with minimin partial criteria is considered. Necessary and suf...
We consider the multicriteria problem of combinatorial optimization with partial criteria of the kin...
International audienceCombinatorial optimization problems serve as models for a great number of real...
A multiobjective problem of integer linear programming with parametric optimality is addressed. The ...
In this paper, a lexicographic multicriteria optimization problem with interval coefficients is cons...
We consider a multiple objective combinatorial optimization problem with an arbitrary vector-criteri...
We consider a multicriteria lexicographic Boolean problem of minimizing absolute deviations of linea...
Multi-criteria optimization problems naturally arise in practice when there is no single criterion f...
In the paper we investigate the possibility of finding the Pareto set in combinatorial multicriteria...
multicriteria linear combinatorial problem is considered, principle of optimality of which is defi...
AbstractWe consider multiple objective 0–1 programming problems in the situation where parameters of...
The paper concerns multiobjective linear optimization problems in Rn that are parameterized with res...
International audienceThis work proposes an upper bound on the maximal number of non-dominated point...